Reactive GRASP for the Prize-collecting Covering Tour Problem

This paper presents a Greedy Randomized Adaptive Search Procedure (GRASP) for the Prize-Collecting Covering Tour Problem (PCCTP), which is problem of finding route traveling teams that provide services to communities geographically distant from large urban locations. We devised novel hybrid heuristic by combining reactive extension GRASP with Random Variable Neighborhood (VND) meta-heuristic purpose solving PCCTP. Computational experiments were conducted on PCCTP benchmark literature, and results demonstrate our approach provides significant improvement in comparable state-of-the-art, mainly regarding computational processing time.